Search results for "Approximation Methods"

showing 3 items of 3 documents

Efficient estimation of generalized linear latent variable models.

2019

Generalized linear latent variable models (GLLVM) are popular tools for modeling multivariate, correlated responses. Such data are often encountered, for instance, in ecological studies, where presence-absences, counts, or biomass of interacting species are collected from a set of sites. Until very recently, the main challenge in fitting GLLVMs has been the lack of computationally efficient estimation methods. For likelihood based estimation, several closed form approximations for the marginal likelihood of GLLVMs have been proposed, but their efficient implementations have been lacking in the literature. To fill this gap, we show in this paper how to obtain computationally convenient estim…

0106 biological sciencesMultivariate statisticsMultivariate analysisComputer scienceBinomials01 natural sciencesPolynomials010104 statistics & probabilityAmoebastilastolliset mallitestimointiProtozoansLikelihood FunctionsMultidisciplinaryApproximation MethodsStatistical ModelsSimulation and ModelingApplied MathematicsStatisticsQLinear modelREukaryotaLaplace's methodData Interpretation StatisticalPhysical SciencesVertebratesMedicineAlgorithmAlgorithmsResearch ArticleOptimizationScienceLatent variableResearch and Analysis Methods010603 evolutionary biologygeneralized linear latent variable modelsSet (abstract data type)BirdsAnimalsComputer Simulation0101 mathematicsta112OrganismsBiology and Life SciencesStatistical modelMarginal likelihoodAlgebraAmniotesMultivariate AnalysisLinear ModelsMathematicsSoftwarePLoS ONE
researchProduct

Theory of ground state factorization in quantum cooperative systems.

2008

We introduce a general analytic approach to the study of factorization points and factorized ground states in quantum cooperative systems. The method allows to determine rigorously existence, location, and exact form of separable ground states in a large variety of, generally non-exactly solvable, spin models belonging to different universality classes. The theory applies to translationally invariant systems, irrespective of spatial dimensionality, and for spin-spin interactions of arbitrary range.

High Energy Physics - TheoryQuantum phase transitionGeneral Physics and AstronomyFOS: Physical sciencesFactorizationfactorizationQuantum mechanicsStatistical physicsSOLVABLE MODELVALIDITYENTANGLEMENTQuantumMathematical PhysicsMathematicsQuantum PhysicsMathematical Physics (math-ph)Invariant (physics)BODY APPROXIMATION METHODSUniversality (dynamical systems)Condensed Matter - Other Condensed MatterClosed and exact differential formsHigh Energy Physics - Theory (hep-th)SPIN CHAINGround stateQuantum Physics (quant-ph)Curse of dimensionalityOther Condensed Matter (cond-mat.other)Physical review letters
researchProduct

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Rate-monotonic schedulingEarliest deadline first schedulingOptimizationBipartite graphMathematical optimizationOpen-shop schedulingSchedulesDistributed computingComplexity theoryProcessor schedulingDynamic priority schedulingApproximation methodscoupled-tasksFair-share schedulingApproximation algorithmsFixed-priority pre-emptive schedulingNurse scheduling problemTwo-level schedulingMathematics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct